Where and How Chew's Second Delaunay Refinement Algorithm Works
نویسنده
چکیده
Chew’s second Delaunay refinement algorithm with offcenter Steiner vertices leads to practical improvement over Ruppert’s algorithm for quality mesh generation, but the most thorough theoretical analysis is known only for Ruppert’s algorithm. A detailed analysis of Chew’s second Delaunay refinement algorithm with offcenters is given, improving the guarantee of well-graded output for any minimum angle threshold α ≤ 28.60.
منابع مشابه
Parallel Delaunay Refinement: Algorithms And Analyses
In this paper, we analyze the omplexity of natural parallelizations of Delaunay re nement methods for mesh generation. The parallelizations employ a simple strategy: at ea h iteration, they hoose a set of \independent" points to insert into the domain, and then update the Delaunay triangulation. We show that su h a set of independent points an be onstru ted eÆ iently in parallel and that the nu...
متن کاملTriangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold angle α, the Delaunay refinement algorithms compute triangulations that have all angles at least α. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delauna...
متن کاملkth Nearest Neighbor Sampling in the Plane
Let B be a square region in the plane. We give an efficient algorithm that takes a set P of n points from B, and produces a set M ⊂ B with the property that the distance to the second nearest point in M approximates the distance to the kth nearest point of P . That is, there are constants α, β ∈ R such that for all x ∈ B, we have αdP,k(x) ≤ dM,2(x) ≤ βdP,k(x), where dM,2 and dP,k denote the sec...
متن کاملSize-optimal Steiner points for Delaunay-refinement on curved surfaces
An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is shown that the use of off-centre Steiner points, positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in t...
متن کاملParallel 2D Graded Guaranteed Quality Delaunay Mesh Refinement
We develop a theoretical framework for constructing guaranteed quality Delaunay meshes in parallel for general two-dimensional geometries. This paper presents a new approach for constructing graded meshes, i.e., meshes with element size controlled by a user-defined criterion. The sequential Delaunay refinement algorithms are based on inserting points at the circumcenters of triangles of poor qu...
متن کامل